Fast Approximation Algorithms for Spectral Clustering
نویسنده
چکیده
The sponsor of this project is the Business Analytics and Mathematical Sciences (BAMS) Department of the IBM T.J. Watson Research Center in New York. The industry Mentor is Christos Boutsidis and the mentor team consists of Christos, Bo Zhang, and Daniel Connors, all part of BAMS, IBM. The best way to reach Christos is: [email protected]. His number at work in New York is 914-945-1972.
منابع مشابه
Fast Spectral Clustering via the Nyström Method
We propose and analyze a fast spectral clustering algorithm with computational complexity linear in the number of data points that is directly applicable to large-scale datasets. The algorithm combines two powerful techniques in machine learning: spectral clustering algorithms and Nyström methods commonly used to obtain good quality low rank approximations of large matrices. The proposed algori...
متن کاملFast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques by Lorenzo Orecchia Doctor of Philosophy in Computer Science University of California, Berkeley Professor Satish Rao, Chair Graph-partitioning problems are a central topic of research in the study of approximation algorithms. They are of interest to both theoreticians, for their far-reach...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملSpectral Clustering via the Power Method - Provably
Spectral clustering is arguably one of the most important algorithms in data mining and machine intelligence; however, its computational complexity makes it a challenge to use it for large scale data analysis. Recently, several approximation algorithms for spectral clustering have been developed in order to alleviate the relevant costs, but theoretical results are lacking. In this paper, we pre...
متن کاملApproximate Spectral Clustering via Randomized Sketching
Spectral clustering is arguably one of the most important algorithms in data mining and machine intelligence; however, its computational complexity makes it a challenge to use it for large scale data analysis. Recently, several approximation algorithms for spectral clustering have been developed in order to alleviate the relevant costs, but theoretical results are lacking. In this paper, we pre...
متن کامل